TSTP Solution File: NLP266^12 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : NLP266^12 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 09:41:03 EDT 2023
% Result : CounterSatisfiable 36.48s 36.76s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NLP266^12 : TPTP v8.1.2. Released v8.1.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.16/0.34 % Computer : n003.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu Aug 24 12:01:07 EDT 2023
% 0.16/0.35 % CPUTime :
% 0.20/0.48 %----Proving TH0
% 0.20/0.48 %------------------------------------------------------------------------------
% 0.20/0.48 % File : NLP266^12 : TPTP v8.1.2. Released v8.1.0.
% 0.20/0.48 % Domain : Natural Language Processing
% 0.20/0.48 % Problem : Generation of abstract instructions: enter a number in a box
% 0.20/0.48 % Version : [BP13] axioms.
% 0.20/0.48 % English :
% 0.20/0.48
% 0.20/0.48 % Refs : [Sto00] Stone (2000), Towards a Computational Account of Knowl
% 0.20/0.48 % : [RO12] Raths & Otten (2012), The QMLTP Problem Library for Fi
% 0.20/0.48 % : [BP13] Benzmueller & Paulson (2013), Quantified Multimodal Lo
% 0.20/0.48 % : [Ste22] Steen (2022), An Extensible Logic Embedding Tool for L
% 0.20/0.48 % Source : [TPTP]
% 0.20/0.48 % Names : APM003+1 [QMLTP]
% 0.20/0.48
% 0.20/0.48 % Status : CounterCounterSatisfiable
% 0.20/0.48 % Rating : 1.00 v8.1.0
% 0.20/0.48 % Syntax : Number of formulae : 38 ( 12 unt; 22 typ; 10 def)
% 0.20/0.48 % Number of atoms : 72 ( 10 equ; 0 cnn)
% 0.20/0.48 % Maximal formula atoms : 18 ( 4 avg)
% 0.20/0.48 % Number of connectives : 104 ( 1 ~; 1 |; 3 &; 95 @)
% 0.20/0.48 % ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% 0.20/0.48 % Maximal formula depth : 20 ( 5 avg)
% 0.20/0.48 % Number of types : 3 ( 1 usr)
% 0.20/0.48 % Number of type conns : 77 ( 77 >; 0 *; 0 +; 0 <<)
% 0.20/0.48 % Number of symbols : 22 ( 21 usr; 3 con; 0-4 aty)
% 0.20/0.48 % Number of variables : 43 ( 35 ^; 5 !; 3 ?; 43 :)
% 0.20/0.48 % SPC : TH0_CSA_EQU_NAR
% 0.20/0.48
% 0.20/0.48 % Comments : This output was generated by embedproblem, version 1.7.1 (library
% 0.20/0.48 % version 1.3). Generated on Thu Apr 28 13:18:18 EDT 2022 using
% 0.20/0.48 % 'modal' embedding, version 1.5.2. Logic specification used:
% 0.20/0.48 % $modal == [$constants == $rigid,$quantification == $varying,
% 0.20/0.48 % $modalities == $modal_system_S5U].
% 0.20/0.48 %------------------------------------------------------------------------------
% 0.20/0.48 thf(mworld,type,
% 0.20/0.48 mworld: $tType ).
% 0.20/0.48
% 0.20/0.48 thf(mrel_type,type,
% 0.20/0.48 mrel: mworld > mworld > $o ).
% 0.20/0.48
% 0.20/0.48 thf(mactual_type,type,
% 0.20/0.48 mactual: mworld ).
% 0.20/0.48
% 0.20/0.48 thf(mlocal_type,type,
% 0.20/0.48 mlocal: ( mworld > $o ) > $o ).
% 0.20/0.48
% 0.20/0.48 thf(mlocal_def,definition,
% 0.20/0.48 ( mlocal
% 0.20/0.48 = ( ^ [Phi: mworld > $o] : ( Phi @ mactual ) ) ) ).
% 0.20/0.48
% 0.20/0.48 thf(mnot_type,type,
% 0.20/0.48 mnot: ( mworld > $o ) > mworld > $o ).
% 0.20/0.48
% 0.20/0.48 thf(mand_type,type,
% 0.20/0.48 mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.20/0.48
% 0.20/0.48 thf(mor_type,type,
% 0.20/0.48 mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.20/0.48
% 0.20/0.48 thf(mimplies_type,type,
% 0.20/0.48 mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.20/0.48
% 0.20/0.48 thf(mequiv_type,type,
% 0.20/0.48 mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.20/0.48
% 0.20/0.48 thf(mnot_def,definition,
% 0.20/0.48 ( mnot
% 0.20/0.48 = ( ^ [A: mworld > $o,W: mworld] :
% 0.20/0.48 ~ ( A @ W ) ) ) ).
% 0.20/0.48
% 0.20/0.48 thf(mand_def,definition,
% 0.20/0.48 ( mand
% 0.20/0.48 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.20/0.48 ( ( A @ W )
% 0.20/0.48 & ( B @ W ) ) ) ) ).
% 0.20/0.48
% 0.20/0.48 thf(mor_def,definition,
% 0.20/0.48 ( mor
% 0.20/0.48 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.20/0.48 ( ( A @ W )
% 0.20/0.48 | ( B @ W ) ) ) ) ).
% 0.20/0.48
% 0.20/0.48 thf(mimplies_def,definition,
% 0.20/0.48 ( mimplies
% 0.20/0.48 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.20/0.48 ( ( A @ W )
% 0.20/0.48 => ( B @ W ) ) ) ) ).
% 0.20/0.48
% 0.20/0.48 thf(mequiv_def,definition,
% 0.20/0.48 ( mequiv
% 0.20/0.48 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.20/0.48 ( ( A @ W )
% 0.20/0.48 <=> ( B @ W ) ) ) ) ).
% 0.20/0.48
% 0.20/0.48 thf(mbox_type,type,
% 0.20/0.48 mbox: ( mworld > $o ) > mworld > $o ).
% 0.20/0.48
% 0.20/0.48 thf(mbox_def,definition,
% 0.20/0.48 ( mbox
% 0.20/0.48 = ( ^ [Phi: mworld > $o,W: mworld] :
% 0.20/0.48 ! [V: mworld] :
% 0.20/0.48 ( ( mrel @ W @ V )
% 0.20/0.48 => ( Phi @ V ) ) ) ) ).
% 0.20/0.48
% 0.20/0.48 thf(mdia_type,type,
% 0.20/0.48 mdia: ( mworld > $o ) > mworld > $o ).
% 0.20/0.48
% 0.20/0.48 thf(mdia_def,definition,
% 0.20/0.48 ( mdia
% 0.20/0.48 = ( ^ [Phi: mworld > $o,W: mworld] :
% 0.20/0.48 ? [V: mworld] :
% 0.20/0.48 ( ( mrel @ W @ V )
% 0.20/0.48 & ( Phi @ V ) ) ) ) ).
% 0.20/0.48
% 0.20/0.48 thf(mrel_universal,axiom,
% 0.20/0.48 ! [W: mworld,V: mworld] : ( mrel @ W @ V ) ).
% 0.20/0.48
% 0.20/0.48 thf(eiw_di_type,type,
% 0.20/0.48 eiw_di: $i > mworld > $o ).
% 0.20/0.48
% 0.20/0.48 thf(eiw_di_nonempty,axiom,
% 0.20/0.48 ! [W: mworld] :
% 0.20/0.48 ? [X: $i] : ( eiw_di @ X @ W ) ).
% 0.20/0.48
% 0.20/0.48 thf(mforall_di_type,type,
% 0.20/0.48 mforall_di: ( $i > mworld > $o ) > mworld > $o ).
% 0.20/0.48
% 0.20/0.48 thf(mforall_di_def,definition,
% 0.20/0.48 ( mforall_di
% 0.20/0.48 = ( ^ [A: $i > mworld > $o,W: mworld] :
% 0.20/0.48 ! [X: $i] :
% 0.20/0.49 ( ( eiw_di @ X @ W )
% 0.20/0.49 => ( A @ X @ W ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(mexists_di_type,type,
% 0.20/0.49 mexists_di: ( $i > mworld > $o ) > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(mexists_di_def,definition,
% 0.20/0.49 ( mexists_di
% 0.20/0.49 = ( ^ [A: $i > mworld > $o,W: mworld] :
% 0.20/0.49 ? [X: $i] :
% 0.20/0.49 ( ( eiw_di @ X @ W )
% 0.20/0.49 & ( A @ X @ W ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 %%% This output was generated by tptputils, version 1.2.
% 0.20/0.49 %%% Generated on Wed Apr 27 15:22:07 CEST 2022 using command 'downgrade(tff)'.
% 0.20/0.49 thf(u_decl,type,
% 0.20/0.49 u: $i ).
% 0.20/0.49
% 0.20/0.49 thf(one_decl,type,
% 0.20/0.49 one: $i ).
% 0.20/0.49
% 0.20/0.49 thf(number_decl,type,
% 0.20/0.49 number: $i > $i > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(string_decl,type,
% 0.20/0.49 string: $i > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(in_decl,type,
% 0.20/0.49 in: $i > $i > $i > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(do_decl,type,
% 0.20/0.49 do: $i > $i > $i > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(entry_box_decl,type,
% 0.20/0.49 entry_box: $i > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(userid_decl,type,
% 0.20/0.49 userid: $i > $i > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(ax1,axiom,
% 0.20/0.49 ( mlocal
% 0.20/0.49 @ ( mbox
% 0.20/0.49 @ ( mexists_di
% 0.20/0.49 @ ^ [I: $i] : ( mbox @ ( mand @ ( userid @ u @ I ) @ ( string @ I ) ) ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(ax2,axiom,
% 0.20/0.49 ( mlocal
% 0.20/0.49 @ ( mexists_di
% 0.20/0.49 @ ^ [B: $i] : ( mbox @ ( mand @ ( entry_box @ B ) @ ( number @ B @ one ) ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(ax3,axiom,
% 0.20/0.49 ( mlocal
% 0.20/0.49 @ ( mbox
% 0.20/0.49 @ ( mforall_di
% 0.20/0.49 @ ^ [S: $i] :
% 0.20/0.49 ( mforall_di
% 0.20/0.49 @ ^ [I: $i] :
% 0.20/0.49 ( mforall_di
% 0.20/0.49 @ ^ [B: $i] :
% 0.20/0.49 ( mimplies @ ( mand @ ( string @ I ) @ ( entry_box @ B ) )
% 0.20/0.49 @ ( mexists_di
% 0.20/0.49 @ ^ [A: $i] :
% 0.20/0.49 ( mbox
% 0.20/0.49 @ ( mforall_di
% 0.20/0.49 @ ^ [S2: $i] : ( mimplies @ ( do @ S @ A @ S2 ) @ ( in @ I @ B @ S2 ) ) ) ) ) ) ) ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(con,conjecture,
% 0.20/0.49 ( mlocal
% 0.20/0.49 @ ( mbox
% 0.20/0.49 @ ( mexists_di
% 0.20/0.49 @ ^ [I: $i] :
% 0.20/0.49 ( mexists_di
% 0.20/0.49 @ ^ [B: $i] :
% 0.20/0.49 ( mexists_di
% 0.20/0.49 @ ^ [A: $i] :
% 0.20/0.49 ( mexists_di
% 0.20/0.49 @ ^ [S: $i] :
% 0.20/0.49 ( mand @ ( mbox @ ( mand @ ( userid @ u @ I ) @ ( mand @ ( entry_box @ B ) @ ( number @ B @ one ) ) ) )
% 0.20/0.49 @ ( mbox
% 0.20/0.49 @ ( mforall_di
% 0.20/0.49 @ ^ [S2: $i] : ( mimplies @ ( do @ S @ A @ S2 ) @ ( in @ I @ B @ S2 ) ) ) ) ) ) ) ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 %------------------------------------------------------------------------------
% 0.20/0.49 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.gTrV5ObaGv/cvc5---1.0.5_29321.p...
% 0.20/0.49 (declare-sort $$unsorted 0)
% 0.20/0.49 (declare-sort tptp.mworld 0)
% 0.20/0.49 (declare-fun tptp.mrel (tptp.mworld tptp.mworld) Bool)
% 0.20/0.49 (declare-fun tptp.mactual () tptp.mworld)
% 0.20/0.49 (declare-fun tptp.mlocal ((-> tptp.mworld Bool)) Bool)
% 0.20/0.49 (assert (= tptp.mlocal (lambda ((Phi (-> tptp.mworld Bool))) (@ Phi tptp.mactual))))
% 0.20/0.49 (declare-fun tptp.mnot ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.49 (declare-fun tptp.mand ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.49 (declare-fun tptp.mor ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.49 (declare-fun tptp.mimplies ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.49 (declare-fun tptp.mequiv ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.49 (assert (= tptp.mnot (lambda ((A (-> tptp.mworld Bool)) (W tptp.mworld)) (not (@ A W)))))
% 0.20/0.49 (assert (= tptp.mand (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (and (@ A W) (@ B W)))))
% 0.20/0.49 (assert (= tptp.mor (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (or (@ A W) (@ B W)))))
% 0.20/0.49 (assert (= tptp.mimplies (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (=> (@ A W) (@ B W)))))
% 0.20/0.49 (assert (= tptp.mequiv (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (= (@ A W) (@ B W)))))
% 0.20/0.49 (declare-fun tptp.mbox ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.49 (assert (= tptp.mbox (lambda ((Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (forall ((V tptp.mworld)) (=> (@ (@ tptp.mrel W) V) (@ Phi V))))))
% 0.20/0.49 (declare-fun tptp.mdia ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.49 (assert (= tptp.mdia (lambda ((Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (exists ((V tptp.mworld)) (and (@ (@ tptp.mrel W) V) (@ Phi V))))))
% 36.48/36.76 (assert (forall ((W tptp.mworld) (V tptp.mworld)) (@ (@ tptp.mrel W) V)))
% 36.48/36.76 (declare-fun tptp.eiw_di ($$unsorted tptp.mworld) Bool)
% 36.48/36.76 (assert (forall ((W tptp.mworld)) (exists ((X $$unsorted)) (@ (@ tptp.eiw_di X) W))))
% 36.48/36.76 (declare-fun tptp.mforall_di ((-> $$unsorted tptp.mworld Bool) tptp.mworld) Bool)
% 36.48/36.76 (assert (= tptp.mforall_di (lambda ((A (-> $$unsorted tptp.mworld Bool)) (W tptp.mworld)) (forall ((X $$unsorted)) (=> (@ (@ tptp.eiw_di X) W) (@ (@ A X) W))))))
% 36.48/36.76 (declare-fun tptp.mexists_di ((-> $$unsorted tptp.mworld Bool) tptp.mworld) Bool)
% 36.48/36.76 (assert (= tptp.mexists_di (lambda ((A (-> $$unsorted tptp.mworld Bool)) (W tptp.mworld)) (exists ((X $$unsorted)) (and (@ (@ tptp.eiw_di X) W) (@ (@ A X) W))))))
% 36.48/36.76 (declare-fun tptp.u () $$unsorted)
% 36.48/36.76 (declare-fun tptp.one () $$unsorted)
% 36.48/36.76 (declare-fun tptp.number ($$unsorted $$unsorted tptp.mworld) Bool)
% 36.48/36.76 (declare-fun tptp.string ($$unsorted tptp.mworld) Bool)
% 36.48/36.76 (declare-fun tptp.in ($$unsorted $$unsorted $$unsorted tptp.mworld) Bool)
% 36.48/36.76 (declare-fun tptp.do ($$unsorted $$unsorted $$unsorted tptp.mworld) Bool)
% 36.48/36.76 (declare-fun tptp.entry_box ($$unsorted tptp.mworld) Bool)
% 36.48/36.76 (declare-fun tptp.userid ($$unsorted $$unsorted tptp.mworld) Bool)
% 36.48/36.76 (assert (@ tptp.mlocal (@ tptp.mbox (@ tptp.mexists_di (lambda ((I $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ tptp.mbox (@ (@ tptp.mand (@ (@ tptp.userid tptp.u) I)) (@ tptp.string I))) __flatten_var_0))))))
% 36.48/36.76 (assert (@ tptp.mlocal (@ tptp.mexists_di (lambda ((B $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ tptp.mbox (@ (@ tptp.mand (@ tptp.entry_box B)) (@ (@ tptp.number B) tptp.one))) __flatten_var_0)))))
% 36.48/36.76 (assert (@ tptp.mlocal (@ tptp.mbox (@ tptp.mforall_di (lambda ((S $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ tptp.mforall_di (lambda ((I $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ tptp.mforall_di (lambda ((B $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ (@ tptp.mimplies (@ (@ tptp.mand (@ tptp.string I)) (@ tptp.entry_box B))) (@ tptp.mexists_di (lambda ((A $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ tptp.mbox (@ tptp.mforall_di (lambda ((S2 $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ (@ tptp.mimplies (@ (@ (@ tptp.do S) A) S2)) (@ (@ (@ tptp.in I) B) S2)) __flatten_var_0)))) __flatten_var_0)))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0))))))
% 36.48/36.76 (assert (not (@ tptp.mlocal (@ tptp.mbox (@ tptp.mexists_di (lambda ((I $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ tptp.mexists_di (lambda ((B $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ tptp.mexists_di (lambda ((A $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ tptp.mexists_di (lambda ((S $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ (@ tptp.mand (@ tptp.mbox (@ (@ tptp.mand (@ (@ tptp.userid tptp.u) I)) (@ (@ tptp.mand (@ tptp.entry_box B)) (@ (@ tptp.number B) tptp.one))))) (@ tptp.mbox (@ tptp.mforall_di (lambda ((S2 $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ (@ tptp.mimplies (@ (@ (@ tptp.do S) A) S2)) (@ (@ (@ tptp.in I) B) S2)) __flatten_var_0))))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0)))))))
% 36.48/36.76 (set-info :filename cvc5---1.0.5_29321)
% 36.48/36.76 (check-sat-assuming ( true ))
% 36.48/36.76 ------- get file name : TPTP file name is NLP266^12
% 36.48/36.76 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_29321.smt2...
% 36.48/36.76 --- Run --ho-elim --full-saturate-quant at 10...
% 36.48/36.76 --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 36.48/36.76 --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 36.48/36.76 --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 36.48/36.76 --- Run --no-ho-matching --finite-model-find --uf-ss=no-minimal at 5...
% 36.48/36.76 % SZS status CounterSatisfiable for NLP266^12
% 36.48/36.76 % cvc5---1.0.5 exiting
% 36.48/36.76 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------